Linear fractional programming and duality
نویسندگان
چکیده
This paper presents a dual of a general linear fractional functions programming problem. Dual is shown to be a linear programming problem. Along with other duality theorems, complementary slackness theorem is also proved. A simple numerical example illustrates the result.
منابع مشابه
Optimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملSome Duality Results in Grey Linear Programming Problem
Different approaches are presented to address the uncertainty of data and appropriate description of uncertain parameters of linear programming models. One of them is to use the grey systems theory in modeling such problem. Especially, recently, grey linear programming has attracted many researchers. In this paper, a kind of linear programming with grey coefficients is discussed. Introducing th...
متن کاملExponential membership function and duality gaps for I-fuzzy linear programming problems
Fuzziness is ever presented in real life decision making problems. In this paper, we adapt the pessimistic approach tostudy a pair of linear primal-dual problem under intuitionistic fuzzy (I-fuzzy) environment and prove certain dualityresults. We generate the duality results using exponential membership and non-membership functions to represent thedecision maker’s satisfaction and dissatisfacti...
متن کاملA new Concept of Duality for Linear Fractional Programming Problems
In this paper a new concept of duality is given for the linear fractional programming (LFP) problem in which the objective function is a linear fractional function and where the constraint functions are in the form of linear inequalities. Our result is based on transforming the linear fractional programming problem to an equivalent linear programming with the same dimension. A simple example is...
متن کاملOn duality in linear fractional programming
AlcOa'act. In this paper, a dual of a given linear fractional program is defined and the weak, direct and converse duality theorems are proved. Both the primal and the dual are linear fractional programs. This duality tI-.cory leads to necessary and sufficient conditions for the optimality of a given feasible solution. A unmerical example is presented to illustrate tI'.e t~eory in this connecti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CEJOR
دوره 15 شماره
صفحات -
تاریخ انتشار 2007